Stepwise Refinement of Processes

نویسندگان

  • Steve Reeves
  • David Streader
چکیده

Industry is looking to create a market in reliable “plug-and-play” components. To model components in a modular style it would be useful to combine event-based and state-based reasoning. One of the first steps in building an event-based model is to decide upon a set of atomic actions. This choice will depend on the formalism used, and may restrict in quite unexpected ways what we are able to formalise. In this paper we illustrate some limits to developing real world processes using existing formalisms, and we define a new notion of refinement, vertical refinement, which addresses some of these limitations. We show that using vertical refinement we can rewrite a specification into a different formalism, allowing us to move between handshake processes, broadcast processes and abstract data types.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Action Refinement in Process Algebra and Security Issues

In the design process of distributed systems we may have to replace abstract specifications of components by more concrete specifications, thus providing more detailed design information. In the context of process algebra, this well-known approach is often referred to as action refinement. We study the relationships between action refinement and security properties within the Security Process A...

متن کامل

Refining Distributed Systems using the B Method

This paper makes a proposal for introducing into the B Method [3] a new refinement operator dedicated to take into account distribution fro m the very specification level through all stepwise refinement process of B abstract machines towards actual implementations. Our operator expresses how a whole system composed of many concurrent and communicating processes can be designed by refinement. Su...

متن کامل

Developing a Consensus Algorithm Using Stepwise Refinement

Consensus problems arise in any area of computing where distributed processes must come to a joint decision. Although solutions to consensus problems have similar aims, they vary according to the processor faults and network properties that must be taken into account, and modifying these assumptions will lead to different algorithms. Reasoning about consensus protocols is subtle, and correctnes...

متن کامل

Synchrony Loosening Transformations for Interacting Processes

In this paper we consider synchrony loosening transformations (SLTs) for mnltiparty interactions. Refinement has been applied to several subjects. For example: Data Refinement: Replacing abstract data by more efiieient concrete representation e.g. [23], [5], Action Refinement: Replacing a complex action by a combination of simpler actions (a common refinement), Atomiciiy Refinement: [6]. While ...

متن کامل

Algebraic Specification and Program Development by Stepwise Refinement

Various formalizations of the concept of “refinement step” as used in the formal development of programs from algebraic specifications are presented and compared.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 160  شماره 

صفحات  -

تاریخ انتشار 2006